منابع مشابه
Text Summarization Using Cuckoo Search Optimization Algorithm
Today, with rapid growth of the World Wide Web and creation of Internet sites and online text resources, text summarization issue is highly attended by various researchers. Extractive-based text summarization is an important summarization method which is included of selecting the top representative sentences from the input document. When, we are facing into large data volume documents, the extr...
متن کاملParallel Search-Based Methods in Optimization
Search-based methods like Branch and Bound and Branch and Cut are essential tools in solving diicult problems to optimality in the eld of combinatorial optimization, and much experience has been gathered regarding the design and implementation of parallel methods in this eld. Search-based methods appear, however, also in connection with certain continuous optimization problems and problems in A...
متن کاملEvaluation of Alignment Methods for HTML Parallel Text
The Internet constitutes a potential huge store of parallel text that may be collected to be exploited by many applications such as multilingual information retrieval, machine translation, etc. These applications usually require at least sentence-aligned bilingual text. This paper presents new aligners designed for improving the performance of classical sentence-level aligners while aligning st...
متن کاملtext summarization using cuckoo search optimization algorithm
today, with rapid growth of the world wide web and creation of internet sites and online text resources, text summarization issue is highly attended by various researchers. extractive-based text summarization is an important summarization method which is included of selecting the top representative sentences from the input document. when, we are facing into large data volume documents, the extr...
متن کاملIterated greedy local search methods for unrelated parallel machine scheduling
This work deals with the parallel machines scheduling problem which consists in the assignment of n jobs on m parallel machines. The most general variant of this problem is when the processing time depends on the machine to which each job is assigned to. This case is known as the unrelated parallel machines problem. Similarly to most of the literature, this paper deals with the minimization of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 1988
ISSN: 0001-0782,1557-7317
DOI: 10.1145/42372.42380